Fault Diagnosis using Quantified Boolean Formulas

نویسندگان

  • Hratch Mangassarian
  • Andreas Veneris
  • Marco Benedetti
چکیده

Automatic debugging of sequential circuits has been considered a practically intractable task due to the excessive memory and run-time requirements associated with tackling industrial-size problems. This paper proposes a novel Quantified Boolean Formula (QBF) based approach for fault diagnosis in sequential circuits. A performance-driven succinct QBF encoding of the problem, coupled with the tremendous present-day advances in QBF solvers make this strategy a successful one. Extensive experiments on industrial circuits confirm the memory advantage and demonstrate the outstanding performance of the proposed framework.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using QBF to Increase the Accuracy of SAT-Based Debugging

The burden of debugging significantly slows down the design process of complex systems. Only limited tool support is available and a typical experience is that fixing one problem only leads to finding the next one. Here, we propose an approach that integrates formal verification with diagnosis. The approach is based on Quantified Boolean Formulas (QBF) and ensures, that counterexamples of high ...

متن کامل

Analysis of Incomplete Circuits using Dependency Quantified Boolean Formulas

We consider Dependency Quantified Boolean Formulas (DQBFs), a generalization of Quantified Boolean Formulas (QBFs), and demonstrate that DQBFs are a natural calculus to exactly express the realizability problem of incomplete combinational and sequential circuits with an arbitrary number of (combinational or bounded-memory) black boxes. In contrast to usual approaches for controller synthesis, r...

متن کامل

An Alternative Representation for QBF

Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused on quantified Boolean formulas in prenex normal form (QBF), we explore an alternative representation of quantified Boolean formulas, called Constrained Quantified Formulas (CQF). CQF allows for a more direct represen...

متن کامل

Design Error Diagnosis Based on Verification Techniques

Error diagnosis is becoming more difficult in VLSI circuit designs due to the increasing complexity. In this paper, we present an algorithm based on verification for improving the accuracy of design error diagnosis. This algorithm integrates three-valued logic simulation and Boolean satisfiability(SAT). It uses test patterns generated by gate level stuck-at fault ATPG tool for parallel pattern ...

متن کامل

Expressiveness and Complexity of Subclasses of Quantified Boolean Formulas

We give a brief overview of expressiveness and complexity results for a hierarchy of subclasses of quantified Boolean formulas with close connections to Boolean circuits and minimal unsatisfiability.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007